Using Rich Pictures to Verify, Contradict, or Enhance Verbal Data
نویسندگان
چکیده
منابع مشابه
A Statistical Model to Verify Verbal Material
In natural language processing up to now mainly rule-based systems have been used. The rulebased approach has been successful for limited domains, where the manual construction of the rules is feasible. In recent studies, however, a need for automatic generation of the rules has been seen. On the other hand, when children learn their mother tongue no explicit rules seem to be needed. Therefore,...
متن کاملEye opener: exploring complexity using rich pictures
Historically, approaches to exploring complexity have mainly focused on the notion that complex problems must be deconstructed into simpler parts if we are to make sense of them; this is the so-called reductionist approach. When dealing with the complexity of human experience, however, deconstructing the experience without diminishing it is a daunting, perhaps impossible task. Researchers wishi...
متن کاملUsing Rich Pictures in Information Systems Teaching
The Rich Picture (RP), as described in Peter Checkland’s Soft Systems Methodology, is a flexible graphical technique used to represent a situation, problem or concept. In a university teaching environment which aims to encourage students to adopt deep learning (seeking meaning) approaches when learning about information systems, the RP is proving to be a useful technique. The use of and reactio...
متن کاملConsiderations for Using Research Data to Verify Clinical Data Accuracy
Collected to support clinical decisions and processes, clinical data may be subject to validity issues when used for research. The objective of this study is to examine methods and issues in summarizing and evaluating the accuracy of clinical data as compared to primary research data. We hypothesized that research survey data on a patient cohort could serve as a reference standard for uncoverin...
متن کاملWhat Makes Petri Nets Harder to Verify: Stack or Data?
We show how the yardstick construction of Stockmeyer, also developed as counter bootstrapping by Lipton, can be adapted and extended to obtain new lower bounds for the coverability problem for two prominent classes of systems based on Petri nets: Ackermann-hardness for unordered data Petri nets, and Tower-hardness for pushdown vector addition systems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Qualitative Report
سال: 2018
ISSN: 2160-3715,1052-0147
DOI: 10.46743/2160-3715/2018.3279